Bordering method to compute Core-EP inverse
نویسندگان
چکیده
منابع مشابه
An Efficient Schulz-type Method to Compute the Moore-Penrose Inverse
A new Schulz-type method to compute the Moore-Penrose inverse of a matrix is proposed. Every iteration of the method involves four matrix multiplications. It is proved that this method converge with fourth-order. A wide set of numerical comparisons shows that the average number of matrix multiplications and the average CPU time of our method are considerably less than those of other methods.
متن کاملAn integer arithmetic method to compute generalized matrix inverse and solve linear equations exactly
Whether a matrix A over a complex field is singular square, or rectangular, it has always a generalized inverse (g-inverse) over the (complex) field. The true inverse exists only when ,4 is nonsingular (i.e., a square matrix whose determinant is not zero). However, a g-inverse of an m x n matrix of rank r involves considerable errors if the rth order submatrices are near-singular. Further, the ...
متن کاملAn Optimal Algorithm to Compute the Inverse Beacon Attraction Region
The beacon model is a recent paradigm for guiding the trajectory of messages or small robotic agents in complex environments. A beacon is a fixed point with an attraction pull that can move points within a given polygon. Points move greedily towards a beacon: if unobstructed, they move along a straight line to the beacon, and otherwise they slide on the edges of the polygon. The Euclidean dista...
متن کاملA method to compute periodic sums
In a number of problems in computational physics, a finite sum of kernel functions centered at N particle locations located in a box in three dimensions must be extended by imposing periodic boundary conditions on box boundaries. Even though the finite sum can be efficiently computed via fast summation algorithms, such as the fast multipole method (FMM), the periodized extension is usually trea...
متن کاملBiorthogonal Polynomials and the Bordering Method for Linear Systems
The problem of solving a system of linear equations is equivalent to the computation of biorthogonal polynomials and to the bordering method which is a procedure for solving recursively a sequence of linear systems with increasing dimensions. In some cases, the biorthogonal polynomials can be computed recursively thus leading to procedures for solving linear systems. The particular cases of Han...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Special Matrices
سال: 2018
ISSN: 2300-7451
DOI: 10.1515/spma-2018-0016